Caterpillars Have Antimagic Orientations
نویسندگان
چکیده
منابع مشابه
Super ( , - Edge - Antimagic Graphs
A graph G of order p and size q is called (a,d)-edge-antimagic total if there exists a one-to-one and onto mapping f from ∪ , ,... , such that the edge weights , ∈ form an AP progression with first term ’a’ and common difference ’d’. The graph G is said to be Super (a,d)-edge-antimagic total labeling if the , , ... , . In this paper we obtain Super (a,d)-edge-antimagic properties of certain cla...
متن کاملUniversal caterpillars
For a class V of graphs, denote by a(@?) the least value of m so that for some graph II on m vertices, every GE Q occurs as a subgraph of U. In this note we obtain rather sharp bounds on u(q) when Q is the class of caterpillars on n vertices, i.e., tree with property that the vertices of degree exceeding one induce a path. Recently several of the authors have investigated graphs U(g) which are ...
متن کاملRegular Graphs are Antimagic
In this note we prove with a slight modification of an argument of Cranston et al. [2] that k-regular graphs are antimagic for k ≥ 2.
متن کاملTotally antimagic total graphs
For a graph G a bijection from the vertex set and the edge set of G to the set {1, 2, . . . , |V (G)| + |E(G)|} is called a total labeling of G. The edge-weight of an edge is the sum of the label of the edge and the labels of the end vertices of that edge. The vertex-weight of a vertex is the sum of the label of the vertex and the labels of all the edges incident with that vertex. A total label...
متن کاملDense graphs are antimagic
An antimagic labeling of a graph with m edges and n vertices is a bijection from the set of edges to the integers 1, . . . ,m such that all n vertex sums are pairwise distinct, where a vertex sum is the sum of labels of all edges incident with the same vertex. A graph is called antimagic if it has an antimagic labeling. A conjecture of Ringel (see [4]) states that every connected graph, but K2,...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Analele Universitatii "Ovidius" Constanta - Seria Matematica
سال: 2018
ISSN: 1844-0835
DOI: 10.2478/auom-2018-0039